Inference Graphs: A Roadmap
نویسندگان
چکیده
Logical inference is one approach to implementing the reasoning component of a cognitive system. Inference graphs are a method for natural deduction inference which, uniquely in logic-based cognitive systems, use concurrency to reason about multiple possible ways to solve a problem simultaneously, and cancel no-longer-necessary inference operations. We outline extensions to inference graphs which increase their usefulness in cognitive systems, including: the use of a more expressive logic; a method for “whquestion” answering; and a way to focus reasoning on problems which cannot immediately be answered due to incomplete information, so when more information becomes available the inference can proceed. We discuss how these three improvements increase the usefulness of inference graphs in cognitive systems.
منابع مشابه
Machine Learning and Genetic Regulatory Networks: A Review and a Roadmap
Genetic regulatory networks (GRNs) are causal structures which can be represented as large directed graphs. Their inference is a central problem in bioinformatics. Because of the paucity of available data and high levels of associated noise, machine learning is essential in performing a good and tractable inference of the underlying causal structure. This chapter serves as a review of the GRN f...
متن کاملDatabase Inference – Conceptual Graphs Using Conceptual Graphs To Represent Database Inference Security Analysis
This paper describes an approach to database inference analysis based on conceptual graphs. The database inference problem is briefly described. Previous approaches are summarized, followed by a presentation of our inference model, called AERIE. The notions of an inference target class and an inference method class are introduced with examples given. Conceptual graphs are introduced as our mean...
متن کاملFrom Constrained Delaunay Triangulations to Roadmap Graphs with Arbitrary Clearance
This work studies path planning in two-dimensional space, in the presence of polygonal obstacles. We specifically address the problem of building a roadmap graph, that is, an abstract representation of all the paths that can potentially be followed around a given set of obstacles. Our solution consists in an original refinement algorithm for constrained Delaunay triangulations, aimed at generat...
متن کاملComputational Geometric Learning Finding a Needle in an Exponential Haystack: Discrete RRT for Exploration of Implicit Roadmaps in Multi-Robot Motion Planning
We present a sampling-based framework for multirobot motion planning which incorporates an implicit representation of a roadmap with a novel approach for pathfinding in geometrically embedded graphs. Our pathfinding algorithm, discrete-RRT (dRRT), is an adaption of the celebrated RRT algorithm, for the discrete case of a graph. By rapidly exploring the high-dimensional configuration space repre...
متن کاملSparse roadmap spanners for asymptotically near-optimal motion planning
Asymptotically optimal planners, such as PRM∗, guarantee that solutions approach optimal as the number of iterations increases. Roadmaps with this property, however, may grow too large for storing on resource-constrained robots and for achieving efficient online query resolution. By relaxing optimality, asymptotically near-optimal planners produce sparser graphs by not including all edges. The ...
متن کامل